Planar graphs

Results: 475



#Item
21Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs

Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs

Add to Reading List

Source URL: users.uoa.gr

- Date: 2014-06-11 17:30:32
    22Tight Bounds for Linkages in Planar Graphs. 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, Lecture Notes in Computer Science, Springer Verlag, 2011. Irrelevant Vertices for the Planar D

    Tight Bounds for Linkages in Planar Graphs. 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, Lecture Notes in Computer Science, Springer Verlag, 2011. Irrelevant Vertices for the Planar D

    Add to Reading List

    Source URL: users.uoa.gr

    - Date: 2014-06-11 17:30:28
      23Short proofs of coloring theorems on planar graphs Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew Yancey Sobolev Institute of Mathematics and Novosibirsk State University University of Illinois at Urba

      Short proofs of coloring theorems on planar graphs Oleg V. Borodin, Alexandr V. Kostochka, Bernard Lidický, Matthew Yancey Sobolev Institute of Mathematics and Novosibirsk State University University of Illinois at Urba

      Add to Reading List

      Source URL: orion.math.iastate.edu

      - Date: 2014-08-22 14:45:57
        24Fine structure of 4-critical triangle-free graphs II. Planar triangle-free graphs with two precolored 4-cycles Zdenˇek Dvoˇra´k∗  Bernard Lidick´

        Fine structure of 4-critical triangle-free graphs II. Planar triangle-free graphs with two precolored 4-cycles Zdenˇek Dvoˇra´k∗ Bernard Lidick´

        Add to Reading List

        Source URL: orion.math.iastate.edu

        - Date: 2015-05-27 17:11:40
          25On choosability with separation of planar graphs with lists of different sizes H. A. Kierstead ∗

          On choosability with separation of planar graphs with lists of different sizes H. A. Kierstead ∗

          Add to Reading List

          Source URL: orion.math.iastate.edu

          - Date: 2014-08-22 14:45:17
            26Extending 3-coloring of a face in triangle-free planar graphs ˇ Dvoˇrák, Bernard Lidický Zdenek Charles University in Prague University of Illinois at Urbana-Champaign

            Extending 3-coloring of a face in triangle-free planar graphs ˇ Dvoˇrák, Bernard Lidický Zdenek Charles University in Prague University of Illinois at Urbana-Champaign

            Add to Reading List

            Source URL: orion.math.iastate.edu

            - Date: 2014-08-22 14:45:42
              27A Linear Kernel for Finding Square Roots of Almost Planar Graphs Petr A. Golovach1 , Dieter Kratsch2 , Dani¨el Paulusma3 , and Anthony Stewart3 1  2

              A Linear Kernel for Finding Square Roots of Almost Planar Graphs Petr A. Golovach1 , Dieter Kratsch2 , Dani¨el Paulusma3 , and Anthony Stewart3 1 2

              Add to Reading List

              Source URL: community.dur.ac.uk

              - Date: 2016-04-01 09:07:08
                285-list-coloring planar graphs with distant precolored vertices Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y†

                5-list-coloring planar graphs with distant precolored vertices Zdenˇek Dvoˇra´k∗ Bernard Lidick´ y†

                Add to Reading List

                Source URL: orion.math.iastate.edu

                - Date: 2014-08-22 14:45:13
                  293-coloring planar graphs with four triangles ˇ Dvoˇrák, Alexandr V. Kostochka, Oleg V. Borodin, Zdenek Bernard Lidický, Matthew Yancey Sobolev Institute of Mathematics and Novosibirsk State University Charles Univers

                  3-coloring planar graphs with four triangles ˇ Dvoˇrák, Alexandr V. Kostochka, Oleg V. Borodin, Zdenek Bernard Lidický, Matthew Yancey Sobolev Institute of Mathematics and Novosibirsk State University Charles Univers

                  Add to Reading List

                  Source URL: orion.math.iastate.edu

                  - Date: 2014-08-22 14:45:34
                    30On Choosability with Separation of Planar Graphs with Forbidden Cycles Ilkyoo Choi∗ Bernard Lidick´ y∗

                    On Choosability with Separation of Planar Graphs with Forbidden Cycles Ilkyoo Choi∗ Bernard Lidick´ y∗

                    Add to Reading List

                    Source URL: orion.math.iastate.edu

                    - Date: 2014-08-22 14:44:50